Depthmap: A Program to Perform Visibility Graph Analysis
نویسنده
چکیده
Here we present Depthmap, a program designed to perform visibility graph analysis of spatial environments. The program allows a user to import a 2D layout in drawing exchange format (DXF), and to fill the open spaces of this layout with a grid of points. The user may then use the program to make a visibility graph representing the visible connections between those point locations. Once the graph has been constructed the user may perform various analyses of the graph, concentrating on those which have previously been found to be useful for spatial description and movement forecasting within the Space Syntax literature. Some measures which have not received so much mainstream attention have also been implemented. In addition to graph analysis, a few sundry tools are also enabled so that the user may make minor adjustments to the graph. Depthmap has been implemented for the Windows 95/98/NT and 2000 platforms.
منابع مشابه
Visibility Analysis in a Point Cloud Based on the Medial Axis Transform
Visibility analysis is an important application of 3D GIS data. Current approaches require 3D city models that are often derived from detailed aerial point clouds. We present an approach to visibility analysis that does not require a city model but works directly on the point cloud. Our approach is based on the medial axis transform, which models the urban environment as a union of balls, which...
متن کاملEpileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملMULTI - LEVEL COMPLEXITY IN TERMS OF SPACE SYNTAX : a case study 044
This paper is inspired by a wayfinding study by Hölscher et al. (2005), who find serious wayfinding difficulties in a complex multi-level building and identify architectural properties related to the difficulties. The present study re-analyzes the qualitative results in terms of Space Syntax measures and thus ties them down to formal properties of the architectural structure. The analysis caref...
متن کاملUCL Depthmap 7: From Isovist Analysis to Generic Spatial Network Analysis
This short paper discusses some of the new functions available in UCL Depthmap 7. UCL Depthmap’s original purpose was to perform integration analysis of isovists just as the integration of axial lines could be calculated. It has now developed in a number of different directions, so it has become closer to a traditional GIS system with analysis functions for graphs built in. In doing so, it has ...
متن کاملEdge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths
In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of preprocessing. However, Visibility Graphs are known to perform poorly in terms of running time, es...
متن کامل